Computational Experiments with the Roots of Fibonacci-like Polynomials as a Window to Mathematics Research
نویسندگان
چکیده
Fibonacci-like polynomials, the roots of which are responsible for a cyclic behavior orbits second-order two-parametric difference equation, considered. Using Maple and Wolfram Alpha, location largest smallest cycles period p among periods 2kp (period-doubling) kp (period-multiplying) has been determined. These purely computational results experimental mathematics, made possible by use modern digital tools, can be used as motivation confirmation through not-yet-developed methods formal mathematics.
منابع مشابه
Roots of a Type of Generalized Quasi-Fibonacci Polynomials
Let a be a nonnegative real number and define a quasi-Fibonacci polynomial sequence by F a 1 (x) = −a, F a 2 (x) = x − a, and F a n (x) = F a n−1(x) + xF a n−2(x) for n ≥ 2. Let ra n denote the maximum real root of F a n . We prove for certain values of a that the sequence {ra 2n} converges monotonically to βa = a 2 + a from above and the sequence {ra 2n+1} converges monotonically to βa from be...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولOn the properties of generalized Fibonacci like polynomials
The Fibonacci polynomial has been generalized in many ways,some by preserving the initial conditions,and others by preserving the recurrence relation.In this article,we study new generalization {Mn}(x ), with initial conditions M0(x ) = 2 and M1(x ) = m (x ) + k (x ), which is generated by the recurrence relation Mn+1(x ) = k (x )Mn (x )+Mn−1(x ) for n ≥ 2, where k (x ), m (x ) are polynomials ...
متن کاملHOMFLY Polynomials of Torus Links as Generalized Fibonacci Polynomials
The focus of this paper is to study the HOMFLY polynomial of (2, n)-torus link as a generalized Fibonacci polynomial. For this purpose, we first introduce a form of generalized Fibonacci and Lucas polynomials and provide their some fundamental properties. We define the HOMFLY polynomial of (2, n)-torus link with a way similar to our generalized Fibonacci polynomials and provide its fundamental ...
متن کاملMathematics as a Computational Model
Simple basic mathematical notation and natural deduction are used everyday by the average person to do computation. This paper discusses the beauty of this model of computation and questions why this model has not been adopted. A brief description is given of a prototype implementation of this model. The main focus of the paper is on the considerable benefits the current mathematical model has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11020048